An active set truncated Newton method for large-scale bound constrained optimization
نویسندگان
چکیده
منابع مشابه
A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
A new method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the approximate solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The algorithm proposed is based on a simple, smooth unconstrained reformul...
متن کاملAn Active Set-type Newton Method for Constrained Nonlinear Systems
We consider the problem of nding a solution of a nonlinear system of equations subject to some box constraints. To this end, we introduce a new active set-type Newton method with global and local fast convergence properties. The method generates feasible iterates and has to solve only one linear system of equations at each iteration. Due to our active set strategy, this linear system is of redu...
متن کاملAn active-set trust-region method for derivative-free nonlinear bound-constrained optimization
We consider an implementation of a recursive model-based active-set trust-region method for solving bound-constrained nonlinear non-convex optimization problems without derivatives using the technique of self-correcting geometry proposed in [24]. Considering an active-set method in modelbased optimization creates the opportunity of saving a substantial amount of function evaluations when mainta...
متن کاملA subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
In this paper we propose a subspace limited memory quasi-Newton method for solving large-scale optimization with simple bounds on the variables. The limited memory quasi-Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. The search direction consists of three parts: a subspace quasi-Ne...
متن کاملA Two-Stage Active-Set Algorithm for Bound-Constrained Optimization
In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in [1] with a modification of the nonmonotone line search framework recently proposed in [2]. In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction of the objective function when sett...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2014
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.01.009